Domain transformation approach to deterministic optimization of examination timetables
نویسندگان
چکیده
منابع مشابه
Domain transformation approach to deterministic optimization of examination timetables
In this paper we introduce a new optimization method for the examinations scheduling problem. Rather than attempting direct optimization of assignments of exams to specific time-slots, we perform permutations of slots and reassignments of exams upon the feasible (but not optimal) schedules obtained by the standard graph colouring method with Largest Degree ordering. The proposed optimization me...
متن کاملCombining Human and Machine Intelligence to Produce Effective Examination Timetables
In this paper we present a system for producing good examination timetables, by integrating the search capabilities of computer heuristics and the cognitive capabilities of timetabling users. We allow users to view and easily edit a cognitively manageable representation of each timetable, using the STARK (Semantically Transparent Approach to Representing Knowledge) approach. Further, we allow u...
متن کاملfrom linguistics to literature: a linguistic approach to the study of linguistic deviations in the turkish divan of shahriar
chapter i provides an overview of structural linguistics and touches upon the saussurean dichotomies with the final goal of exploring their relevance to the stylistic studies of literature. to provide evidence for the singificance of the study, chapter ii deals with the controversial issue of linguistics and literature, and presents opposing views which, at the same time, have been central to t...
15 صفحه اولAdaptive linear combination of heuristic orderings in constructing examination timetables
In this paper, we investigate an adaptive linear combinations of graph coloring heuristics with a heuristic modifier for solving the examination timetabling problem. We invoke a normalisation strategy for each parameter in order to generalise the specific problem data. Two graph coloring heuristics were used in this study (largest degree and saturation degree). A score for the difficulty of ass...
متن کاملExamination Timetables and Tabu Search with Longer-Term Memory
The examination scheduling problem has been examined and a four-phase system using a tabu search algorithm, OTTABU, has been implemented. This system uses both recency-based short-term memory and move (or frequency)-based longer-term memory to improve the quality of the solutions found. The system was tested using real data obtained from the University of Ottawa registrar’s office and real exam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence Research
سال: 2012
ISSN: 1927-6982,1927-6974
DOI: 10.5430/air.v2n1p122